Online Parallel Machine Scheduling to Maximize the Number of Early Jobs
نویسندگان
چکیده
منابع مشابه
Online Parallel Machine Scheduling to Maximize the Number of Early Jobs
We study a maximization problem: online scheduling on m identical machines to maximize the number of early jobs. The problem is online in the sense that all jobs arrive over time. Each job’s characteristics, such as processing time and due date, become known at its arrival time. We consider the preemption-restart model, in which preemption is allowed, while once a job is restarted, it loses all...
متن کاملOnline Scheduling of Bounded Length Jobs to Maximize Throughput
We consider an online scheduling problem, motivated by the following online auction setting. A non-storable perishable good is produced at a regular rate. It has to be sold immediately to customers whose offers arrive on-line. More formally, we consider the online scheduling problem with preemptions, where each job j is revealed at release time rj , has processing time pj , deadline dj and weig...
متن کاملMetaheuristics for scheduling on parallel machine to minimize weighted number of early and tardy jobs
This paper considers the scheduling of n jobs on m parallel machines to minimize the weighted number of early and tardy jobs. The single machine case of this problem has been shown to be NPcomplete in the strong sense. This problem on m parallel machine is also NP complete in the strong sense and finding an optimal solution appears unlikely. The problem is formulated as an integer linear progra...
متن کاملOnline Scheduling of Malleable Parallel Jobs
In this paper, we study a parallel job scheduling model which takes into account both computation time and the overhead from communication between processors. Assuming that a job Jj has a processing requirement pj and is assigned to kj processors for parallel execution, then the execution time will be modeled by tj = pj/kj+(kj−1)·c, where c is the constant overhead cost associated with each pro...
متن کاملSolving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs
Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2012
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2012/939717